Mcmullen’s Root-finding Algorithm for Cubic Polynomials
نویسندگان
چکیده
We show that a generally convergent root-finding algorithm for cubic polynomials defined by C. McMullen is of order 3, and we give generally convergent algorithms of order 5 and higher for cubic polynomials. We study the Julia sets for these algorithms and give a universal rational map and Julia set to explain the dynamics.
منابع مشابه
SOME SPECTRAL APPLICATIONS OF McMULLEN’S HAUSDORFF DIMENSION ALGORITHM
Using McMullen’s Hausdorff dimension algorithm, we study numerically the dimension of the limit set of groups generated by reflections along three geodesics on the hyperbolic plane. Varying these geodesics, we found four minima in the two-dimensional parameter space, leading to a rigorous result why this must be so. Extending the algorithm to compute the limit measure and its moments, we study ...
متن کاملSome Observations on Khovanskii’s Matrix Methods for Extracting Roots of Polynomials
In this article we apply a formula for the n-th power of a 3×3 matrix (found previously by the authors) to investigate a procedure of Khovanskii’s for finding the cube root of a positive integer. We show, for each positive integer α, how to construct certain families of integer sequences such that a certain rational expression, involving the ratio of successive terms in each family, tends to α....
متن کاملP -adic root separation for quadratic and cubic polynomials
We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible cubic polynomials are completely understood, while in the irreducible cubic case, we give a family of polynomials with the bound which is the best currently known.
متن کاملScalar-vector algorithm for the roots of quadratic quaternion polynomials, and the characterization of quintic rational rotation-minimizing frame curves
The scalar–vector representation is used to derive a simple algorithm to obtain the roots of a quadratic quaternion polynomial. Apart from the familiar vector dot and cross products, this algorithm requires only the determination of the unique positive real root of a cubic equation, and special cases (e.g., double roots) are easily identified through the satisfaction of algebraic constraints on...
متن کاملReal root refinements for univariate polynomial equations
Real root finding of polynomial equations is a basic problem in computer algebra. This task is usually divided into two parts: isolation and refinement. In this paper, we propose two algorithms LZ1 and LZ2 to refine real roots of univariate polynomial equations. Our algorithms combine Newton’s method and the secant method to bound the unique solution in an interval of a monotonic convex isolati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002